A Game-theoretic Analysis of Tcp Vegas and Fast Tcp

نویسندگان

  • Zhenhua Liu
  • Xiaoping Zhang
  • Dong Wang
  • Youjian Zhao
  • Hongtao Guan
چکیده

In this paper, we evaluate the impact of selfish behavior through a game-theoretic analysis of TCP Vegas and FAST TCP. By theoretical analysis, we obtain the Nash Equilibrium in these games and study the loss of efficiency under Nash Equilibrium. Our results show that if the users are selfish, then the efficiency of the network as a whole relies on the utility function of individual users. The efficiency of the system degrades under some conditions and remains optimal under other conditions. This motivates us to borrow the notions of Price of Anarchy and Tragedy of the Commons in Game Theory to describe this efficiency loss. We calculate the Price of Anarchy and provide the necessary and sufficient condition under which the TCP Vegas Game (FAST TCP Game) is a Tragedy of the Commons. Finally, we validate the theoretical results by the simulations carried out using NS-2.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parameter Setting Games in TCP Vegas and FAST TCP

This paper is concerned with the parameter setting problems of some delaybased versions of TCP (TCP Vegas and the recently developed Vegas-based FAST TCP) from a game-theoretic point of view. It is shown that if the TCP Vegas’ users are assumed to be selfish in terms of setting their desired number of backlogged packets in the buffers along their paths, then the network as a whole, in certain c...

متن کامل

A Case for TCP Vegas and Gateways using Game Theoretic Approach

TCP Vegas has been introduced in an attempt to improve the performance of TCP Reno and reduce the oscillation e ects. TCP Vegas is, however, criticized for penalizing the users using it in the presence of other users using TCP Reno. In this paper, we model the problem of congestion control as both a single shot game and a repeated game, using a game theoretic approach. We rst show that in the s...

متن کامل

A Game-Theoretic Analysis of TCP Vegas

We use the tools from game theory to understand the impacts of the inherent congestion pricing schemes in TCP Vegas as well as the problems of parameter setting of TCP Vegas on its performance. It is shown how these inherent pricing schemes result in a rate control equilibrium state that is a Nash equilibrium which is also a global optimum of the all-Vegas networks. On the other hand, if the TC...

متن کامل

Issues in TCP Vegas

The Transmission Control Protocol (TCP) was first proposed and implemented to prevent the future congestion collapses after the congestion collapses in 1986. Since then, it has gone through several phases of improvement, and many new features such as fast retransmit and fast recovery have been added. Recently Brakmo et al. [2] have proposed a new version of TCP, which is named TCP Vegas, with a...

متن کامل

A Window-Based Flow Control Mechanism based on TCP Vegas with Explicit Congestion Notification

A window-based flow control mechanism is a sort of feedback-based congestion control mechanisms, and has been widely used in TCP/IP networks. Recently proposed TCP Vegas is another version of the TCP mechanism and has potential to achieve much better performance than current TCP Tahoe and Reno. In this paper, we focus on a window-based flow control mechanism based on a congestion avoidance mech...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008